0.05/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.05/0.11	% Command    : duper %s
0.10/0.30	% Computer : n007.cluster.edu
0.10/0.30	% Model    : x86_64 x86_64
0.10/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.30	% Memory   : 8042.1875MB
0.10/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.30	% CPULimit   : 1440
0.10/0.30	% WCLimit    : 180
0.10/0.30	% DateTime   : Mon Jul  3 05:42:27 EDT 2023
0.10/0.30	% CPUTime    : 
10.67/10.87	SZS status Theorem for theBenchmark.p
10.67/10.87	SZS output start Proof for theBenchmark.p
10.67/10.87	Clause #1 (by assumption #[]): Eq
10.67/10.87	  (Not
10.67/10.87	    (Exists fun Q =>
10.67/10.87	      Exists fun R => Exists fun Y => And (And (Q Y lAnna_THFTYPE_i) (Not (Eq R Q))) (R Y lBill_THFTYPE_i)))
10.67/10.87	  True
10.67/10.87	Clause #6 (by assumption #[]): Eq (likes_THFTYPE_IiioI lMary_THFTYPE_i lBill_THFTYPE_i) True
10.67/10.87	Clause #7 (by assumption #[]): Eq (Not (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i)) True
10.67/10.87	Clause #24 (by assumption #[]): Eq (parent_THFTYPE_IiioI lMary_THFTYPE_i lBen_THFTYPE_i) True
10.67/10.87	Clause #43 (by clausification #[1]): Eq
10.67/10.87	  (Exists fun Q => Exists fun R => Exists fun Y => And (And (Q Y lAnna_THFTYPE_i) (Not (Eq R Q))) (R Y lBill_THFTYPE_i))
10.67/10.87	  False
10.67/10.87	Clause #44 (by clausification #[43]): ∀ (a : Iota → Iota → Prop),
10.67/10.87	  Eq (Exists fun R => Exists fun Y => And (And (a Y lAnna_THFTYPE_i) (Not (Eq R a))) (R Y lBill_THFTYPE_i)) False
10.67/10.87	Clause #45 (by clausification #[44]): ∀ (a a_1 : Iota → Iota → Prop),
10.67/10.87	  Eq (Exists fun Y => And (And (a Y lAnna_THFTYPE_i) (Not (Eq a_1 a))) (a_1 Y lBill_THFTYPE_i)) False
10.67/10.87	Clause #46 (by clausification #[45]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota) (a_2 : Iota → Iota → Prop),
10.67/10.87	  Eq (And (And (a a_1 lAnna_THFTYPE_i) (Not (Eq a_2 a))) (a_2 a_1 lBill_THFTYPE_i)) False
10.67/10.87	Clause #47 (by clausification #[46]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota) (a_2 : Iota → Iota → Prop),
10.67/10.87	  Or (Eq (And (a a_1 lAnna_THFTYPE_i) (Not (Eq a_2 a))) False) (Eq (a_2 a_1 lBill_THFTYPE_i) False)
10.67/10.87	Clause #48 (by clausification #[47]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota) (a_2 : Iota → Iota → Prop),
10.67/10.87	  Or (Eq (a a_1 lBill_THFTYPE_i) False) (Or (Eq (a_2 a_1 lAnna_THFTYPE_i) False) (Eq (Not (Eq a a_2)) False))
10.67/10.87	Clause #49 (by clausification #[48]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota) (a_2 : Iota → Iota → Prop),
10.67/10.87	  Or (Eq (a a_1 lBill_THFTYPE_i) False) (Or (Eq (a_2 a_1 lAnna_THFTYPE_i) False) (Eq (Eq a a_2) True))
10.67/10.87	Clause #50 (by clausification #[49]): ∀ (a : Iota → Iota → Prop) (a_1 : Iota) (a_2 : Iota → Iota → Prop),
10.67/10.87	  Or (Eq (a a_1 lBill_THFTYPE_i) False) (Or (Eq (a_2 a_1 lAnna_THFTYPE_i) False) (Eq a a_2))
10.67/10.87	Clause #138 (by clausification #[7]): Eq (likes_THFTYPE_IiioI lSue_THFTYPE_i lMary_THFTYPE_i) False
10.67/10.87	Clause #876 (by superposition #[50, 6]): ∀ (a : Iota → Iota → Prop),
10.67/10.87	  Or (Eq (a lMary_THFTYPE_i lAnna_THFTYPE_i) False) (Or (Eq (fun x x_1 => likes_THFTYPE_IiioI x x_1) a) (Eq False True))
10.67/10.87	Clause #924 (by betaEtaReduce #[876]): ∀ (a : Iota → Iota → Prop),
10.67/10.87	  Or (Eq (a lMary_THFTYPE_i lAnna_THFTYPE_i) False) (Or (Eq likes_THFTYPE_IiioI a) (Eq False True))
10.67/10.87	Clause #925 (by clausification #[924]): ∀ (a : Iota → Iota → Prop), Or (Eq (a lMary_THFTYPE_i lAnna_THFTYPE_i) False) (Eq likes_THFTYPE_IiioI a)
10.67/10.87	Clause #951 (by fluidLoobHoist #[925]): ∀ (a : Iota → Iota → Prop),
10.67/10.87	  Or (Eq likes_THFTYPE_IiioI a) (Or (Eq True False) (Eq (a lMary_THFTYPE_i lAnna_THFTYPE_i) False))
10.67/10.87	Clause #954 (by clausification #[951]): ∀ (a : Iota → Iota → Prop), Or (Eq likes_THFTYPE_IiioI a) (Eq (a lMary_THFTYPE_i lAnna_THFTYPE_i) False)
10.67/10.87	Clause #956 (by superposition #[954, 24]): Or (Eq likes_THFTYPE_IiioI fun x x_1 => parent_THFTYPE_IiioI x lBen_THFTYPE_i) (Eq False True)
10.67/10.87	Clause #957 (by clausification #[956]): Eq likes_THFTYPE_IiioI fun x x_1 => parent_THFTYPE_IiioI x lBen_THFTYPE_i
10.67/10.87	Clause #1006 (by fluidSup #[957, 954]): ∀ (a : Prop), Or (Eq likes_THFTYPE_IiioI fun x x => a) (Eq ((fun _ => a) likes_THFTYPE_IiioI) False)
10.67/10.87	Clause #1041 (by betaEtaReduce #[1006]): ∀ (a : Prop), Or (Eq likes_THFTYPE_IiioI fun x x => a) (Eq a False)
10.67/10.87	Clause #1054 (by falseElim #[1041]): Eq likes_THFTYPE_IiioI fun x x => True
10.67/10.87	Clause #1099 (by argument congruence #[1054]): ∀ (a : Iota), Eq (likes_THFTYPE_IiioI a) ((fun x x => True) a)
10.67/10.87	Clause #1110 (by betaEtaReduce #[1099]): ∀ (a : Iota), Eq (likes_THFTYPE_IiioI a) fun x => True
10.67/10.87	Clause #1112 (by argument congruence #[1110]): ∀ (a a_1 : Iota), Eq (likes_THFTYPE_IiioI a a_1) ((fun x => True) a_1)
10.67/10.87	Clause #1192 (by betaEtaReduce #[1112]): ∀ (a a_1 : Iota), Eq (likes_THFTYPE_IiioI a a_1) True
10.79/10.98	Clause #1193 (by superposition #[1192, 138]): Eq True False
10.79/10.98	Clause #1219 (by clausification #[1193]): False
10.79/10.98	SZS output end Proof for theBenchmark.p
10.82/10.98	EOF